TSTP Solution File: SET636^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET636^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:46 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 49 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 261 ( 76 equ; 0 cnn)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 283 ( 64 ~; 59 |; 41 &; 108 @)
% ( 8 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 84 ( 46 ^ 20 !; 17 ?; 84 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK5: a ).
thf(f58,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f27,f32,f45,f57]) ).
thf(f57,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f56]) ).
thf(f56,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f55,f53]) ).
thf(f53,plain,
( ( $true
= ( sK1 @ sK5 ) )
| spl3_2 ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f51,plain,
( ( $false
!= ( ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| spl3_2 ),
inference(beta_eta_normalization,[],[f50]) ).
thf(f50,plain,
( ( ( ^ [Y0: a] : $false
@ sK5 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK5 ) )
| spl3_2 ),
inference(negative_extensionality,[],[f20]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| spl3_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl3_2
<=> ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f55,plain,
( ( $true
!= ( sK1 @ sK5 ) )
| ~ spl3_1
| spl3_2 ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f54,plain,
( ( $true != $true )
| ( $true
!= ( sK1 @ sK5 ) )
| ~ spl3_1
| spl3_2 ),
inference(superposition,[],[f17,f52]) ).
thf(f52,plain,
( ( $true
= ( sK0 @ sK5 ) )
| spl3_2 ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f17,plain,
( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( ( sK1 @ X3 )
!= $true ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f16]) ).
thf(f16,plain,
( spl3_1
<=> ! [X3: a] :
( ( ( sK1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X3 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f45,plain,
( ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f44]) ).
thf(f44,plain,
( $false
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f40,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f39,f31]) ).
thf(f31,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl3_4
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f39,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( $false = $true )
| ( $false
= ( sK0 @ sK2 ) )
| ~ spl3_2
| ~ spl3_3 ),
inference(superposition,[],[f26,f35]) ).
thf(f35,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl3_2 ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ! [X1: a] :
( $false
= ( ( sK1 @ X1 )
& ( sK0 @ X1 ) ) )
| ~ spl3_2 ),
inference(beta_eta_normalization,[],[f33]) ).
thf(f33,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl3_2 ),
inference(argument_congruence,[],[f21]) ).
thf(f21,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f26,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl3_3
<=> ( $true
= ( sK1 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f32,plain,
( spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f13,f19,f29]) ).
thf(f13,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( ( $true
= ( sK1 @ sK2 ) )
& ( $true
= ( sK0 @ sK2 ) ) ) )
& ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ! [X3: a] :
( ( ( sK1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X3 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ? [X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true ) ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ! [X3: a] :
( ( $true
!= ( X1 @ X3 ) )
| ( $true
!= ( X0 @ X3 ) ) ) ) )
=> ( ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ? [X2: a] :
( ( $true
= ( sK1 @ X2 ) )
& ( $true
= ( sK0 @ X2 ) ) ) )
& ( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ! [X3: a] :
( ( ( sK1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X3 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X2: a] :
( ( $true
= ( sK1 @ X2 ) )
& ( $true
= ( sK0 @ X2 ) ) )
=> ( ( $true
= ( sK1 @ sK2 ) )
& ( $true
= ( sK0 @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ? [X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true ) ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ! [X3: a] :
( ( $true
!= ( X1 @ X3 ) )
| ( $true
!= ( X0 @ X3 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ? [X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true ) ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) )
| ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X0 @ X2 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X0 @ X2 )
!= $true ) )
<~> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ~ ? [X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true ) )
<=> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ~ ? [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) )
<=> ( ( ^ [X3: a] : $false )
= ( ^ [X4: a] :
( ( X0 @ X4 )
& ( X1 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ~ ? [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) )
<=> ( ( ^ [X2: a] : $false )
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ~ ? [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) )
<=> ( ( ^ [X2: a] : $false )
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T2GhmZPnU6/Vampire---4.8_15668',cBOOL_PROP_118_pme) ).
thf(f27,plain,
( ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f14,f24,f19]) ).
thf(f14,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f22,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f12,f19,f16]) ).
thf(f12,plain,
! [X3: a] :
( ( ( sK1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X3 ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET636^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 16:38:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.T2GhmZPnU6/Vampire---4.8_15668
% 0.14/0.38 % (15924)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.14/0.38 % (15925)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.38 % (15926)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.14/0.38 % (15927)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (15928)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (15929)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.38 % (15930)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.38 % (15931)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.14/0.38 % (15927)Instruction limit reached!
% 0.14/0.38 % (15927)------------------------------
% 0.14/0.38 % (15927)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (15927)Termination reason: Unknown
% 0.14/0.38 % (15928)Instruction limit reached!
% 0.14/0.38 % (15928)------------------------------
% 0.14/0.38 % (15928)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (15928)Termination reason: Unknown
% 0.14/0.38 % (15928)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (15928)Memory used [KB]: 5500
% 0.14/0.38 % (15928)Time elapsed: 0.004 s
% 0.14/0.38 % (15928)Instructions burned: 2 (million)
% 0.14/0.38 % (15928)------------------------------
% 0.14/0.38 % (15928)------------------------------
% 0.14/0.38 % (15927)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (15927)Memory used [KB]: 5500
% 0.14/0.38 % (15927)Time elapsed: 0.004 s
% 0.14/0.38 % (15927)Instructions burned: 2 (million)
% 0.14/0.38 % (15927)------------------------------
% 0.14/0.38 % (15927)------------------------------
% 0.14/0.38 % (15931)Refutation not found, incomplete strategy
% 0.14/0.38 % (15931)------------------------------
% 0.14/0.38 % (15931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (15931)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.39
% 0.14/0.39 % (15931)Memory used [KB]: 5500
% 0.14/0.39 % (15931)Time elapsed: 0.004 s
% 0.14/0.39 % (15931)Instructions burned: 2 (million)
% 0.14/0.39 % (15931)------------------------------
% 0.14/0.39 % (15931)------------------------------
% 0.14/0.39 % (15924)First to succeed.
% 0.14/0.39 % (15925)Also succeeded, but the first one will report.
% 0.14/0.39 % (15924)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for Vampire---4
% 0.14/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.39 % (15924)------------------------------
% 0.14/0.39 % (15924)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (15924)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (15924)Memory used [KB]: 5500
% 0.14/0.39 % (15924)Time elapsed: 0.006 s
% 0.14/0.39 % (15924)Instructions burned: 3 (million)
% 0.14/0.39 % (15924)------------------------------
% 0.14/0.39 % (15924)------------------------------
% 0.14/0.39 % (15923)Success in time 0.006 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------